Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
نویسندگان
چکیده
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
منابع مشابه
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus
The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that the trace equivalence remains undecidable even if the number of labels is restricted to two. The undecidability result holds also for the simulation of two-label BPP processes. These results imply undecidability of some behavioral type systems for the π-calculus.
متن کاملRefining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملUndecidability of BPP Equivalences Revisited
Hüttel [3] gave a proof of the undecidability of BPP equivalences. In this note, we point out some of the flaws in his proof, and provide a new, actually simpler proof. 1 Flaws in Hüttel’s Proof Hüttel [3] proves that all BPP equivalences between ready simulation equivalence and trace equivalence are undecidable by encoding a Minsky machine M into two BPP processes L and L, so that (i) If M hal...
متن کاملA Hierarchy of Behavioral Equivalences in the π-calculus with Noisy Channels
The π-calculus is a process algebra where agents interact by sending communication links to each other via noiseless communication channels. Taking into account the reality of noisy channels, an extension of the π-calculus, called the πN -calculus, has been introduced recently. In this paper, we present an early transitional semantics of the πN calculus, which is not a directly translated versi...
متن کاملToward Observational Equivalences for Linear Logic Concurrent Constraint Languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007